Predicting the Performance of Randomized Parallel Search: An Application to Robot Motion Planning
نویسندگان
چکیده
In this paper we discuss methods for predicting the performance of any formulation of randomized parallel search, and propose a new performance prediction method that is based on obtaining an accurate estimate of the k-processor run-time distribution. We show that the k-processor prediction method delivers accurate performance predictions and demonstrate the validity of our analysis on several robot motion planning problems.
منابع مشابه
Trajectory Optimization of Cable Parallel Manipulators in Point-to-Point Motion
Planning robot trajectory is a complex task that plays a significant role in design and application of robots in task space. The problem is formulated as a trajectory optimization problem which is fundamentally a constrained nonlinear optimization problem. Open-loop optimal control method is proposed as an approach for trajectory optimization of cable parallel manipulator for a given two-end-po...
متن کاملParallel Search Algorithms for Robot Motion Planning
In this paper we show that parallel search techniques derived from their sequential counterparts can enable the solution of instances of the robot motion planning problem that are computationally infeasible on sequential machines. We present a simple parallel version of a robot motion planning algorithm based on "quasi best first" search with randomized escape from local minima and random backt...
متن کاملFast Motion Planning for Dexterous Robots
We show that paths for dexterous robots can be generated in a few seconds or less using parallel informed randomized search on multicomputers. The experimental results we present have been obtained for a simulated 7-jointed arm operating in realistic 3D workspaces. We also present a new method for predicting the solution times that our parallel formulation can deliver on increasing numbers of p...
متن کاملToward Real - Time Motion
We show that parallel search techniques derived from their sequential counterparts can enable the solution of motion planning problems that are computationally impractical on sequential machines. We present a parallel version of a robot motion planning algorithm based on \quasi best rst" search with randomized escape from local minima and random backtracking, and discuss its performance on a va...
متن کاملA parallel Formulation of Informed Randomized Search for Robot Motion Planning Problems
We show how paths for articulated robots with many degrees of freedom can be generated in a few seconds or less using nonsystematic parallel search. We present experimental results obtained on a multicomputer for an accurate model of a 7-jointed manipulator arm operating in realistic 3D workspaces. We then present and discuss a fast method for smoothing the paths delivered by the parallel algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Intelligent and Robotic Systems
دوره 38 شماره
صفحات -
تاریخ انتشار 2003